Playing Dominoes Is Hard, Except by Yourself
نویسندگان
چکیده
Dominoes is a popular and well-known game possibly dating back three millennia. Players are given a set of domino tiles, each with two labeled square faces, and take turns connecting them into a growing chain of dominoes by matching identical faces. We show that singleplayer dominoes is in P, while multiplayer dominoes is hard: when players cooperate, the game is NP-complete, and when players compete, the game is PSPACE-complete. In addition, we show that these hardness results easily extend to games involving team play.
منابع مشابه
Predicting the Fall of Dominoes Milestone 5
By studying the physics behind toppling dominoes we are able to create a theory to predict the time for the dominoes to fall and if necessary, find an arrangement of dominoes that will optimize the topple time. The conservation of energy is used and all interactions between the dominoes are neglected except for the initial impact. Using the number of dominoes, the geometry of the chain, and the...
متن کاملThe complexity of domino tiling
In this paper, we study the problem of how to tile a layout with dominoes. For non-coloured dominoes, this can be determined easily by testing whether the layout graph has a perfect matching. We study here tiling with coloured dominoes, where colours of adjacent dominoes must match. It was known that this problem is NP-hard when the layout graph is a tree. We first strengthen this NP-hardness r...
متن کاملSplicing semigroups of dominoes and DNA
We introduce semigroups of dominoes as a tool for working with sets of linked strings. In particular, we are interested in splicing semigroups of dominoes. In the special case of alphabetic (symbol-to-symbol linked) dominoes the splicing semigroups are essentially equivalent to the splicing systems introduced by Head to study infor-mational macromolecules, speciically to study the eeect of sets...
متن کاملColoring and extremal problems in combinatorics by Jacob Manske
ii DEDICATION To M. and D., for making me who I am today. iii If people did not sometimes do silly things, nothing intelligent would ever get done. There's no ulterior practical purpose here. I'm just playing. That's what math is – wondering, playing, amusing yourself with your imagination.
متن کاملOn the Complexity of n-player Toppling Dominoes
Why are n-player games much more complex than two-player games? Is it much more difficult to cooperate or to compete? n-player Toppling Dominoes is an n-player version of Toppling Dominoes, a two-player combinatorial game. Because of queer games, i.e., games where no player has a winning strategy, cooperation is a key-factor in nplayer games and, as a consequence, n-player Toppling Dominoes pla...
متن کامل